Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies
نویسنده
چکیده
In Central Europe transportation accounts for an estimated 30% of the total costs of round timber and is an essential element of cost. In this paper, Tabu Search based methods for solving the Timber Transport Vehicle Routing Problem (TTVRP) are presented. The TTVRP uses solutions of preceding optimization problems as input that are obtained with standard solver software. The presented methods differ with respect to the considered neighborhood and the static or dynamic setting of their parameters. They are verified with real life data in extensive numerical studies and compared to the results obtained with the solver software Xpress. It is shown that the methods are capable to generate good solutions in reasonable computing time. In Central Europe transportation accounts for an estimated 30% of the total costs of round timber and is therefore an essential element of cost. This percentage can also be found in related literature. Murphy (2003) states that log transport accounts for 20 to 30% of the seedling to mill-door discounted costs in New Zealand. Favreau (2006) mentions that transport is the biggest cost item in round timber costs in Canada; he estimates that it is more than 30% of the round timber costs. In Germany the transportation costs from wood storage locations to industrial sites are estimated to be 30% of the price of round timber by von Bodelschwingh (2001). Palmgren, Rönnqvist, and Värbrand (2003) present absolute cost values and state that forestry companies in Sweden spend up DOI: 10.4018/jisscm.2011040102 16 International Journal of Information Systems and Supply Chain Management, 4(2), 15-41, April-June 2011 Copyright © 2011, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. to US$ 270 million a year on transporting logs from harvesting locations to customers. In Austria approximately 25 million cubic meters of round timber are further processed at sawmills. A considerable amount is directly delivered by log-trucks. Flisberg, Liden, and Rönnqvist (2009) state that log-truck scheduling has traditionally been a manual process performed by transport planners responsible for a small number of trucks over a specified and limited region. The same is true for companies the author has worked with in Austria. This highlights the need for efficient decision support systems in round timber transport to obtain optimal routing decisions. Gronalt, Chloupek, Greigeritsch, and Häuslmayer (2005) give a description of the forest-wood supply chain and its elements. The material flow starts at the forest. The trees are cut down, and the stems are brought to wood storage locations. From there, the round timber is transported directly to the industrial sites or transshipment points. These transports are typically carried out by log-trucks. Figure 1 shows this first part of the wood supply chain. The information flow in the wood supply chain involves different actors, such as forest owners, shippers, representatives of industrial sites, and wood retailers. Important information include time schedules for harvesting operations, quantities, assortments, prices, capacities, weather forecasts, and geographic information. In order to reduce transportation costs in the forest-wood supply chain it is necessary to look at this problem from a tactical and operational viewpoint. At first it must be determined which industrial sites should be supplied by which wood storage locations. This problem can be easily formulated as Standard Transportation Problem (TPP). Epstein, Rönnqvist, and WeinFigure 1. Transport modes for round timber 25 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the publisher's webpage: www.igi-global.com/article/minimizing-empty-truck-loads-
منابع مشابه
Tabu Search based solution methods for scheduling log-trucks
We present Tabu Search based solution heuristics for the Timber Transport Vehicle Routing Problem (TTVRP) that differ with respect to solution space. The TTVRP is characterized as follows: a fleet of m log-trucks which are situated at the respective homes of the truck drivers has to fulfil n transports of round timber between different wood storage locations and industrial sites. All transports...
متن کاملControl Design Optimization of Truck Braking System using Bacterial-Foraging-Tabu-Search Metaheuristics
This short article presents control designs of truck braking system. It describes design comparisons among the simple internal model control (SIMC), Ziegler-Nichol (ZN), Cohen-Coon (CC) methods, and the proposed bacterial-foraging-tabu-search (BFTS) metaheuristics. The proposed BF-TF algorithms are explained. The article also presents simulation results and discussions. Keywords—truck braking c...
متن کاملA tabu search approach to the truck scheduling problem with multiple docks and time windows
While organizing the cross-docking operations, cross-dock managers are confronted with many decision problems. One of these problems is the truck scheduling problem. This article presents a truck scheduling problem that is concerned with both inbound and outbound trucks at multiple dock doors. The objective is to minimize the total travel time and the total tardiness. The truck scheduling probl...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملHeuristic with elements of tabu search for Truck and Trailer Routing Problem
Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, SiteDependent Truck and Trailer Routing Problem with hard and soft Time Windows an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJISSCM
دوره 4 شماره
صفحات -
تاریخ انتشار 2011